منابع مشابه
Generalized resolution search
Difficult discrete optimization problems are often solved using a Branch and Bound approach. Resolution search is an alternate approach proposed by Chvátal for 0-1 problems, allowing more flexibility in the search process. In this paper, we generalize the Resolution Search to any discrete problem.
متن کاملGeneralized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs
Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...
متن کاملA Generalized Resolution Theorem
W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of resolution on algebraic domains [1]. This framework allows reasoning with knowledge which is hierarchically structured and forms a (suitable) domain, more precisely, a coherent algebraic cpo as studied in domain theory. In this paper, we give conditions under which a resolution theorem — in a form underlying resolution-based ...
متن کاملGeneralized Proof Number Search
We present Generalized Proof Number Search (GPNS), a Proof Number based algorithm able to prove positions in games with multiple outcomes. GPNS is a direct generalization of Proof Number Search (PNS) in the sense that both behave exactly the same way in games with two outcomes. However, GPNS targets a wider class of games. When a game features more than two outcomes, PNS can be used multiple ti...
متن کاملGeneralized Quantum Search Hamiltonian
There are hamiltonians that solve a search problem of finding one of N items in O( √ N) steps. They are hamiltonians to describe an oscillation between two states. In this paper we propose a generalized search hamiltonian, Hg. Then the known search hamiltonians become special cases of Hg. From the generalized search hamiltonian, we present remarkable results that searching with 100% is subject ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2011
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2010.08.004